CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Source URL: www.cccg.ca

• Mathematics
• Dominating set
• Unit disk graph
• Independent set
• APX
• Approximation algorithm
• Vertex cover
• Planar separator theorem
• Theoretical computer science
• Graph theory
• NP-complete problems

Astro 305: Problem Set 4 Due OctoberCosmic Recombination

Source URL: background.uchicago.edu

• Special relativity
• Minkowski spacetime
• Polarization
• Radiometry
• Stokes parameters
• Tensor
• Wilkinson Microwave Anisotropy Probe
• Lorentz transformation
• Matrix
• Physics
• Relativity
• Spacecraft

Problem Set 4 Ay 124: Structure and Dynamics of Galaxies Handed out: February 25th 2010; Due back: March 11thpoints] We can measure the diskiness of an isophote in an elliptical galaxy by fitting an ellipse

Source URL: www.tapir.caltech.edu

• Cosmic distance ladder
• Physical cosmology
• Ellipse
• Luminosity
• Physics
• Astrophysics
• Astrometry

Downlink: 2013:196:09:22::196:09:30:20 SG1 Problem:  CDS ID# opened byu GN: SG-1 - EO-1: station communication failure between HW control and ACU.           Therefore the CU was not set up at AO

Source URL: eo1.gsfc.nasa.gov

Physics 423 — Problem set 10 — 4/13 – 4/17: Linear Dielectrics Reading: Griffiths 4.4 & 5. 1. A liquid with dielectric constant ǫr = 3 includes a spherical bubble of radius a filled with air (er = 1). At the preci

Source URL: solar.physics.montana.edu

• Chemical properties
• Dipole
• Dielectric
• Electric dipole moment
• Physics
• Chemistry
• Electromagnetism

Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Interval graph
• Vertex cover
• Graph coloring
• Matching
• Independent set
• Dominating set
• Path decomposition
• Graph theory
• Theoretical computer science
• Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗†

Source URL: 2011.cccg.ca

• Largest empty rectangle
• Algorithm
• Closest pair of points problem
• Reduction
• Computer science
• Computational geometry
• Beta skeleton
• Mathematics
• Applied mathematics
• Computational complexity theory

MATH2901/AS2/SC/ UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operational Research I Problems Set 2 1. Consider the following LP problem :

Source URL: hkumath.hku.hk

• Numerical software
• Maths24
• PROPT

On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams†

Source URL: www.stanford.edu

• NP-complete problems
• Logic in computer science
• Exponential time hypothesis
• 2-satisfiability
• Boolean satisfiability problem
• Conjunctive normal form
• Time complexity
• Parameterized complexity
• Dominating set
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Problem Set SOLUTIONS: Heliophysics Textbook II: Chapter 9 Cosmic-Ray Problem Solutions. J. R. Jokipii 1. In this case, the transport equation becomes ∂f

Source URL: www.heliophysics.ucar.edu